Scheduling of Update Transactions for Real-time Data Freshness using EDF & DSEDF

نویسندگان

  • Gauri Chavan
  • Vidya Gogate
چکیده

The real time data is stored in real time database. To maintain the temporal validity of real time data different real time scheduling algorithms are used. The valid data is further used for different operations in real time sensing and control system or in process control applications. The real time data values are stored in real time database at every instant of time. So previous data value becomes stale. The new data value is called as fresh data. To store the data values at every instant update transactions are used. Each update transaction is having number of update jobs. These jobs are used to store current data values in real time database. The scheduling algorithms like Earliest Deadline First (EDF) and Deferrable scheduling with Earliest deadline first (DS-EDF) are used to maintain the real time data valid. In this paper we show the scheduling of number of update transactions using Horn’s algorithm for earliest Deadline first and Deferrable scheduling with Earliest Deadline First algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Comparison of Modified CO-DSEDF with CO-LALF for CO-Scheduling of Update and Control Transactions of Real Time Data

Real time system is the system where data should be processed in time. The real time data is stored in real time database within the specified time interval. This time interval is called as validity time interval [1],[2]. The validity of real time data is maintained using different scheduling algorithms. The process of maintaining the validity of real time data is done by using several update t...

متن کامل

Error-Driven QoS Management in Imprecise Real-Time Databases

In applications such as web-applications, e-commerce, and engine control, the demand for real-time data services has increased. In these applications, requests have to be processed within their deadlines using fresh data. Since the workload of these systems cannot be precisely predicted, they can become overloaded and as a result, deadline and freshness violations may occur. To address this pro...

متن کامل

Adaptive Update Policy for Proactive Management of Deadline Miss Ratio and Data Freshness in Real-Time Database Models

Important applications, like e-commerce, online stock trading, traffic control demand real-time data services. Conventional database perform poor at these applications. A database for real-time data services has to support timing constraints and temporal consistency in addition to supporting characteristics of a conventional database system. In other words, it is desirable to execute transactio...

متن کامل

Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Multiprocessor architecture becomes common on realtime systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, ...

متن کامل

Incorporating load factor into the scheduling of soft real-time transactions for main memory databases

| Many real-time applications have very tight time constraints which couldn't be met by disk resident databases. For those applications, main memory database where entire database is stored in main memory is the proper choice. It has been shown that coarse-granule locking is better than ne-granule locking for main-memory databases. Coarse-granule locking makes it easy to extract data access pat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014